Model checking for a multi-execution memory model

Multi-execution memory models, such as Promising and Weakestmo, are an advanced class of weak consistency models that justify certain outcomes a concurrent program by considering multiple candidate executions collectively. While this key characteristic allows them to support effective compilation hardware wide range compiler optimizations, it makes reasoning about substantially more difficult. In particular, we observe Weakestmo inhibit model checking because they allow some suprisingly behaviors cannot be generated examining one execution at time. We therefore introduce Weakestmo2, strengthening constraining its multi-execution nature, while preserving the important properties Weakestmo: DRF theorems, correctness local transformations. Our rules out surprisingly behaviors, which attempt characterize with help two novel properties: load buffering race freedom certification locality. addition, develop WMC, checker for Weakestmo2 performance close best tools per-execution models.